Specializations of Ferrers ideals
نویسندگان
چکیده
We introduce a specialization technique in order to study monomial ideals that are generated in degree two by using our earlier results about Ferrers ideals. It allows us to describe explicitly a cellular minimal free resolution of various ideals including any strongly stable and any squarefree strongly stable ideal whose minimal generators have degree two. In particular, this shows that threshold graphs can be obtained as specializations of Ferrers graphs, which explains their similar properties.
منابع مشابه
A note on the edge ideals of Ferrers graphs
We determine the arithmetical rank of every edge ideal of a Ferrers graph.
متن کاملFerrers Graphs and Related Ideals
This abstract is essentially taken from the introduction of the paper Monomial and toric ideals associated to Ferrers graphs [13], written jointly with Alberto Corso. A Ferrers graph is a bipartite graph on two distinct vertex sets X = {x1, . . . , xn} and Y = {y1, . . . , ym} such that if (xi, yj) is an edge of G, then so is (xp, yq) for 1 ≤ p ≤ i and 1 ≤ q ≤ j. In addition, (x1, ym) and (xn, ...
متن کاملMonomial and Toric Ideals Associated to Ferrers Graphs
Each partition λ = (λ1, λ2, . . . , λn) determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed a Ferrers ideal, is a squarefree monomial ideal that is generated by quadrics. We show that such an ideal has a 2-linear minimal free resolution; i.e. it defines a small subscheme. In fact, we prove that this property characterizes Ferrers graphs amo...
متن کاملBetti Numbers of Monomial Ideals and Shifted Skew Shapes
We present two new problems on lower bounds for Betti numbers of the minimal free resolution for monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are quadratic and bihomogeneous with respect to two variable sets, but gives a more finely graded lower bound. These problems are solved for certai...
متن کاملHypergraphs with high projective dimension and 1-dimensional hypergraphs
(Dual) hypergraphs have been used by Kimura, Rinaldo and Terai to characterize squarefree monomial ideals J with pd(R/J) ≤ μ(J) − 1, i.e. whose projective dimension equals the minimal number of generators of J minus 1. In this paper we prove sufficient and necessary combinatorial conditions for pd(R/J) ≤ μ(J)−2. The second main result is an effective explicit procedure to compute the projective...
متن کامل